Optimization of Sparse Cross Array Synthesis via Perturbed Convex Optimization
نویسندگان
چکیده
منابع مشابه
Antenna array pattern synthesis via convex optimization
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great eeciency by recently developed interior-point methods. The synthesis problems involve arrays with arbitrary geometry and element directivity, constraints on far and near eld patterns over narrow or broad frequency bandwidth, and some i...
متن کاملSparse Reinforcement Learning via Convex Optimization
We propose two new algorithms for the sparse reinforcement learning problem based on different formulations. The first algorithm is an off-line method based on the alternating direction method of multipliers for solving a constrained formulation that explicitly controls the projected Bellman residual. The second algorithm is an online stochastic approximation algorithm that employs the regulari...
متن کاملAntenna Array Pattern Synthesis via Convex Optimization - Signal Processing, IEEE Transactions on
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great efficiency by recently developed interior-point methods. The synthesis problems involve arrays with arbitrary geometry and element directivity, constraints on farand near-field patterns over narrow or broad frequency bandwidth, and som...
متن کاملSynthesis of anisotropic suboptimal controllers via convex optimization
This paper considers a disturbance attenuation problem for a linear discrete time invariant system under random disturbances with imprecisely known distributions. The statistical uncertainty is measured in terms of the mean anisotropy functional. The disturbance attenuation capabilities of the system are quantified by the anisotropic norm which is a stochastic counterpart of the H∞ norm. The de...
متن کاملModified GA Optimization of Linear Sparse Array
With a goal to optimize the element positions to reduce the peak sidelobe level (PSLL) of the array pattern, a modified real Genetic Algorithms (MGA) for the synthesis of sparse linear arrays is described. The multiple optimization constrains include the number of elements, the aperture and the minimum element spacing. The advanced new approach reduces the size of the searching area of GA by me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2020
ISSN: 1424-8220
DOI: 10.3390/s20174929